Nonlinear elastic constitutive relations of residually stressed composites with stiff curved fibres

Applied Mathematics and Mechanics - Mechanical models of residually stressed fibre-reinforced solids, which do not resist bending, have been developed in the literature. However, in some residually...     

对称向量拟均衡问题有效解的存在性

利用标量化方法建立对称向量拟均衡问题有效解的存在性定理。作为标量化方法的应用，利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理。     

A posteriori error analysis of a quadratic finite volume method for nonlinear elliptic problems

In this article, we construct and analyze a residual-based a posteriori error estimator for a quadratic finite volume method (FVM) for solving nonlinear elliptic partial differential equations with homogeneous Dirichlet boundary conditions. We shall prove that the a posteriori error estimator yields the global upper and local lower bounds for the norm error of the FVM. So that the a posteriori error estimator is equivalent to the true error in a certain sense. Numerical experiments are performed to illustrate the theoretical results.     

Hilbert’s Nullstellensatz for analytic trigonometric polynomials

This paper proves such a new Hilbert’s Nullstellensatz for analytic trigonometric polynomials that if ${\left\{f_j\right\}}_{j=1}^{n\ge 2}$ are analytic trigonometric polynomials without common zero in the finite complex plane $?$ then there are analytic trigonometric polynomials ${\left\{g_j\right\}}_{j=1}^{n\ge 2}$ obeying ${\sum }_{j=1}^{n\ge 2}{f}_j{g}_j=1$ in $?$, thereby not only strengthening Helmer’s Principal Ideal Theorem for entire functions, but also finding an intrinsic path from Hilbert’s Nullstellensatz for analytic polynomials to Pythagoras’ Identity on $?$.     

NIFTy 3 – Numerical Information Field Theory: A Python Framework for Multicomponent Signal Inference on HPC Clusters

NIFTy , “Numerical Information Field Theory,” is a software framework designed to ease the development and implementation of field inference algorithms. Field equations are formulated independently of the underlying spatial geometry allowing the user to focus on the algorithmic design. Under the hood, NIFTy ensures that the discretization of the implemented equations is consistent. This enables the user to prototype an algorithm rapidly in 1D and then apply it to high‐dimensional real‐world problems. This paper introduces NIFTy  3, a major upgrade to the original NIFTy  framework. NIFTy  3 allows the user to run inference algorithms on massively parallel high performance computing clusters without changing the implementation of the field equations. It supports n‐dimensional Cartesian spaces, spherical spaces, power spaces, and product spaces as well as transforms to their harmonic counterparts. Furthermore, NIFTy  3 is able to handle non‐scalar fields, such as vector or tensor fields. The functionality and performance of the software package is demonstrated with example code, which implements a mock inference inspired by a real‐world algorithm from the realm of information field theory. NIFTy  3 is open‐source software available under the GNU General Public License v3 (GPL‐3) at https://gitlab.mpcdf.mpg.de/ift/NIFTy/tree/NIFTy_3 .     

Contingent derivatives and regularization for noncoercive inverse problems

Abstract

We study the inverse problem of parameter identification in noncoercive variational problems that commonly appear in applied models. We examine the differentiability of the set-valued parameter-to-solution map using the first-order and the second-order contingent derivatives. We explore the inverse problem using the output least-squares and the modified output least-squares objectives. By regularizing the noncoercive variational problem, we obtain a single-valued regularized parameter-to-solution map and investigate its smoothness and boundedness. We also consider optimization problems using the output least-squares and the modified output least-squares objectives for the regularized variational problem. We give a complete convergence analysis showing that for the output least-squares and the modified output least-squares, the regularized minimization problems approximate the original optimization problems suitably. We also provide the first-order and the second-order adjoint method for the computation of the first-order and the second-order derivatives of the output least-squares objective. We provide discrete formulas for the gradient and the Hessian calculation and present numerical results.